On Greedy Graph Coloring in the Distributed Model
نویسندگان
چکیده
In the paper we consider distributed algorithms for greedy graph coloring. For the largest-first (LF) approach, we propose a new distributed algorithm which is shown to color a graph in an expected time of O(∆ log n log∆) rounds, and we prove that any distributed LF-coloring algorithm requires at least Ω(∆) rounds. We discuss the quality of obtained colorings in the general case and for particular graph classes. Finally, we show that other greedy graph coloring approaches, such as smallest-last (SL) or dynamic-saturation (SLF), are not suitable for application in distributed computing, requiringΩ(n) rounds.
منابع مشابه
On the complexity of distributed graph coloring with local minimality constraints
Distributed Greedy Coloring is an interesting and intuitive variation of the standard Coloring problem. Given an order among the colors, a coloring is said to be greedy if there does not exist a vertex for which its associated color can be replaced by a color of lower position in the fixed order without violating the property that neighbouring vertices must receive different colors. We consider...
متن کاملالگوریتم ژنتیک با جهش آشوبی هوشمند و ترکیب چندنقطهای مکاشفهای برای حل مسئله رنگآمیزی گراف
Graph coloring is a way of coloring the vertices of a graph such that no two adjacent vertices have the same color. Graph coloring problem (GCP) is about finding the smallest number of colors needed to color a given graph. The smallest number of colors needed to color a graph G, is called its chromatic number. GCP is a well-known NP-hard problems and, therefore, heuristic algorithms are usually...
متن کاملPerformance Evaluation of Distributed Synchronous Greedy Graph Coloring Algorithms on Wireless Ad Hoc and Sensor Networks
Graph coloring is a widely used technique for allocation of time and frequency slots to nodes, for forming clusters, for constructing independent sets and dominating sets on wireless ad hoc and sensor networks. A good coloring approach should produce low color count as possible. Besides, since the nodes of a wireless ad hoc and sensor network operate with limited bandwidth, energy and computing...
متن کاملPrinciples of Distributed Computing 1 Vertex-coloring 1.1 Take 1: Linial's Coloring Algorithm
In this section, we start the study of LOCAL vertex-coloring algorithms for general graphs. The eventual goal would be to obtain (∆ + 1)-coloring of the graphs — that is, an assignment of colors {1, 2, . . . ,∆ + 1} to vertices such that no two adjacent vertices receive the same color — where ∆ denotes the maximum degree. Notice that by a simple greedy argument, each graph with maximum degree a...
متن کاملA framework for scalable greedy coloring on distributed-memory parallel computers
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a variety of techniques for creating or facilitating concurrency. The latter techniques include exploiting features of the initial data distribution, the use of speculative coloring and randomization, and a BSP-style org...
متن کامل